Manufacturer's mixed pallet design problem

We study a problem faced by a major beverage producer. The company produces and distributes several brands to various customers from its regional distributors. For some of these brands, most customers do not have enough demand to justify full pallet shipments. Therefore, the company decided to design a number of mixed or “rainbow” pallets so that its customers can order these unpopular brands without deviating too much from what they initially need. We formally state the company’s problem as determining the contents of a pre–determined number of mixed pallets so as to minimize the total inventory holding and backlogging costs of its customers over a finite horizon. We first show that the problem is NP–hard. We then formulate the problem as a mixed integer linear program, and incorporate valid inequalities to strengthen the formulation. Finally, we use company data to conduct a computational study to investigate the efficiency of the formulation and the impact of mixed pallets on customers’ total costs.